A nonconstructible $\Delta \sb{3}{}\sp{1}$ set of integers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Of a Set of Integers

For r-~2 let p(n, r ) denote the maximum cardinality of a subset A of N = { 1 , 2 . . . . , n} such that there are no B c A and an integer y with S b = y ' . I t is shown that for any e >-0 and bEB n>-n(e), (l+o(l))2~/t'+l>n('-l>/t'+l)~_p(n, r)~_n~§ for all r_~5, and that for every fixed r~_6, p(n,r)=(l+o(1)).21/t'+~)n (~-1)/('§ as n ~ . Let f(n,m) denote t h e m a x i m u m c a r d i n a l i t...

متن کامل

Sweeping out on a Set of Integers

Let (X, ®, m) be a Lebesgue space, m(X) = 1, and let T be an invertible measurable nonsingular aperiodic transformation of X onto X. If S is a set of r integers, r > 2, then there exists a set A of measure less than /•"' S*_! k~l such that X = U,es T"A. Thus for every infinite set of integers W there exist sets A of arbitrarily small measure such that X = U nniv T"A.

متن کامل

Set theoretical Representations of Integers, I

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a ge...

متن کامل

Hypergroups on the Set of All Integers

Stating a two-parameter class of examples, a — positive — answer is given to the question “Are there any nontrivial hypergroups on Z?” . 1. Background and Introduction In 1989 Zeuner [14] proved that no nontrivial hypergroups (i. e. not the group) exist on the set of real numbers R. Five years later Rösler [5] showed that by weakening the axioms by considering signed hypergroups some of these s...

متن کامل

Solving a Linear Equation in a Set of Integers I

1) A set is called sum-free if no sum of two elements equals a third. It is well known that at most [(N + 1)/2] numbers can be selected from the first N natural numbers to form a sum-free set, and one of the extremal sets is the set of odd numbers. 2) Let r(N) denote the maximal number of integers that can be selected from {1, . . . , N} without including any three-term arithmetical progression...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1967

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1967-0211873-5